An Abstraction-Refinement Methodologyfor Reasoning about Network Games†

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Abstraction-Refinement Methodology for Reasoning about Network Games

Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big ...

متن کامل

Automated Assume-Guarantee Reasoning by Abstraction Refinement

Current automated approaches for compositional model checking in the assume-guarantee style are based on learning of assumptions as deterministic automata. We propose an alternative approach based on abstraction refinement. Our new method computes the assumptions for the assume-guarantee rules as conservative and not necessarily deterministic abstractions of some of the components, and refines ...

متن کامل

Abstraction and Refinement for Local Reasoning

ion and Refinement for Local Reasoning Thomas Dinsdale-Young, Philippa Gardner, and Mark Wheelhouse Imperial College London {td202, pg, mjw03}@ic.ac.uk Abstract. Local reasoning has become a well-established technique in Local reasoning has become a well-established technique in program verification, which has been shown to be useful at many different levels of abstraction. In separation logic,...

متن کامل

Solving Games Via Three-Valued Abstraction Refinement

Article history: Received 19 April 2008 Revised 28 April 2009 Available online 29 January 2010

متن کامل

Abstraction Refinement for Games with Incomplete Information

ion Refinement for Games with Incomplete Information∗ Rayna Dimitrova, Bernd Finkbeiner Universität des Saarlandes {dimitrova,finkbeiner}@cs.uni-sb.de ABSTRACT.Counterexample-guided abstraction refinement (CEGAR) is used in automated software analysis to find suitable finite-state abstractions of infinite-state systems. In this paper, we extend CEGAR to games with incomplete information, as the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games

سال: 2018

ISSN: 2073-4336

DOI: 10.3390/g9030039